Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor
نویسندگان
چکیده
منابع مشابه
Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor
This paper proposes a new replica placement algorithm that expands the exhaustive search limit with reasonable calculation time. It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation. The replica placement problem is to find a replica-server set satisfying service constraints in a content delivery network (CDN). It is derived from the set cover p...
متن کاملA Dynamically Reconfigurable Weakly Programmable Processor Array
As modern areas of application for coarse-grained reconfigurable systems digital signal processing, multimedia in embedded devices, and wireless communication can be mentioned among others. These fields include different algorithms with varying complexity and speed requirements. In this paper a new highly parameterizable coarse-grained reconfigurable architecture called weakly programmable proc...
متن کاملFault Tolerance Technique for Dynamically Reconfigurable Processor
This paper proposes a new technique to detect and eliminates temporary faults on FPGA systems. Soft core processors which can alleviate radiation induced failures is implemented on Virtex-5 FPGA’s. This Fault tolerant technique is implemented using TMR .It recovers from configuration upsets through partial reconfiguration combined with roll-forward recovery .The lockstep scheme used here elimin...
متن کاملAn Algorithm for Dynamically Reconfigurable FPGA Placement
In this paper, we introduce a new placement problem movitated by the Dynamically Reconfigurable FPGA (DRFPGA) architectures. Unlike traditional placement, the problem for DRFPGAs must consider the precedence constraints among logic components. For the placement, we develop an effective metric that can consider wirelength, register requirement, and power consumption simultaneously. With the cons...
متن کاملResource Minimization Method Satisfying Delay Constraint for Replicating Large Contents
How to minimize the number of mirroring resources under a QoS constraint (resource minimization problem) is an important issue in content delivery networks. This paper proposes a novel approach that takes advantage of the parallelism of dynamically reconfigurable processors (DRPs) to solve the resource minimization problem, which is NPhard. Our proposal obtains the optimal solution by running a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Networks and Communications
سال: 2011
ISSN: 2090-7141,2090-715X
DOI: 10.1155/2011/707592